// https://www.acwing.com/problem/content/793/

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

const int MAX_NODES = 100'001;

int nums1[MAX_NODES];
int nums2[MAX_NODES];

int main() {
    string str1, str2;
    cin>>str1>>str2;
    int max_length = max(str1.length(), str2.length());
    int t1=0;
    for (int i=str1.length()-1; i >= 0; i--) {
        nums1[t1++] = str1[i] - '0';
    }

    int t2=0;
    for (int i=str2.length()-1; i >= 0; i--) {
        nums2[t2++] = str2[i] - '0';
    }

    for (int i=0; i<max_length + 1; i++) {
        nums1[i] += nums2[i];
        if (nums1[i] >= 10) {
            nums1[i] %= 10;
            nums1[i+1]++;
        }
    }

    if (nums1[max_length] > 0) {
        cout<<nums1[max_length];
    }
    for (int i=max_length-1; i>=0; i--) {
        cout<<nums1[i];
    }
    cout<<endl;
    return 0;
}
